Negotiating Constitution for Political Unions

This paper provides a cradle-to-grave model for political union between two unequally endowed states. We introduce negotiated, contested, and time-consistent contested constitutions to address various classes of merger problems. Merger agreement is shown to be path dependent and, in some cases, time inconsistent. The possibility of contest constrains the set of mutually agreeable tax rates and provides stability to a constitution. Demographic heterogeneity constrains the set of mutually agreeable mergers. Rent extracted by technologically advanced province for transferring technology to the backward province in a union is shown to be increasing in complexity of technology but bounded from above. The model can also support the possibility of historical cycles of political geography. The main contribution of this paper is to highlight the role of technology gap and unequal distribution of resources in all the above cases.Bargaining, Constitution, Contest, Political Union

Negotiating constitution for political unions

This paper provides a cradle-to-grave model for political union between two unequally endowed states. We introduce negotiated, contested, and time-consistent contested constitutions to address various classes of merger problems. Merger agreement is shown to be path dependent and, in some cases, time inconsistent. The possibility of contest constrains the set of mutually agreeable tax rates and provides stability to a constitution. Demographic heterogeneity constrains the set of mutually agreeable mergers. Rent extracted by technologically advanced province for transferring technology to the backward province in a union is shown to be increasing in complexity of technology but bounded from above. The model can also support the possibility of historical cycles of political geography. The main contribution of this paper is to highlight the role of technology gap and unequal distribution of resources in all the above cases.Bargaining, Constitution, Contest, Political Union

A TSSA algorithm based approach to enhance the performance of warehouse system

In this plethora of increased competitiveness and globalization the effective management of the warehouse system is a challenging task. Realizing that proper scheduling of the warehouses is necessary to outperform the competitors on cost, lead time, and customer service basis (Koster, 1998); the proposed research focuses on optimization of warehouse scheduling problems. This research aims to minimize the total tardiness so that the overall time involved in managing the inventory inside the warehouse could be effectively reduced. This research also deals with the vehicle routing issues in the warehousing scenario and considers various constraints, and decision variables, directly influencing the undertaken objective so as to make the model more realistic to the real world environment. The authors have also proposed a hybrid tabu sample-sort simulated annealing (TSSA) algorithm to reduce the tardiness as well as to enhance the performance of the warehousing system. The proposed TSSA algorithm inherits the merits of the tabu search and sample-sort annealing algorithm. The comparative analysis of the results of the TSSA algorithm with other algorithms such as simulated annealing (SA), tabu search (TS), and hybrid tabu search algorithms indicates its superiority over others, both in terms of computational time as well as total tardiness reduction

Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization

The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In this paper, we reformulate the separable NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. From this geometric perspective, we derive new separable NMF algorithms that are highly scalable and empirically noise robust, and have several other favorable properties in relation to existing methods. A parallel implementation of our algorithm demonstrates high scalability on shared- and distributed-memory machines.Comment: 15 pages, 6 figure

An Empirical Investigation of the Linkage between Dependability, Quality and Customer Satisfaction in Information Intensive Service Firms

The Information service sector e.g. utilities, telecommunications and banking has grown rapidly in recent years and is a significant contributor to the Gross Domestic Product (GDP) of the world’s leading economies. Though, the information service sector has grown significantly, there have been relatively few attempts by researchers to explore this sector. The lack of research in this sector has motivated my PhD research that aims to explore the pre-established relationships between dependability, quality and customer satisfaction (RQ1) within the context of information service sector. Literature looking at the interrelationship between the dependability and quality (RQ2a), and their further impact on customer satisfaction (RQ2b) is also limited. With the understanding that Business to Business (B2B) and Business to Customer (B2C) businesses are different, exploring these relationships in these two different types of information firms will further add to existing literature. This thesis also attempts to investigate the relative significance of dependability and quality in both B2B and B2C information service firms (RQ3a and RQ3b). To address these issues, this PhD research follows a theory testing approach and uses multiple case studies to address the research questions. In total five cases from different B2B and B2C information service firms are being investigated. To explore the causality, the time series data set of over 24 to 60 months time and the ‘Path Analysis’ method has been used. For the generalization of the findings, Cumulative Meta Analysis method has been applied. The findings of this thesis indicate that dependability significantly affects customer satisfaction and an interrelationship exists between dependability and quality that further impacts customer satisfaction. The findings from B2C cases challenges the traditional priority afforded to relational aspect of quality by showing that dependability is the key driver of customer satisfaction. However, B2B cases findings shows that both dependability and quality are key drivers of customer satisfaction. Therefore, the findings of this thesis add considerably to literature in B2B and B2C information services context

An ESPC algorithm based approach to solve inventory deployment problem

Global competitiveness has enforced the hefty industries to become more customized. To compete in the market they are targeting the customers who want exotic products, and faster and reliable deliveries. Industries are exploring the option of satisfying a portion of their demand by converting strategically placed products, this helps in increasing the variability of product produced by them in short lead time. In this paper, authors have proposed a new hybrid evolutionary algorithm named Endosymbiotic-Psychoclonal (ESPC) algorithm to determine the amount and type of product to stock as a semi product in inventory. In the proposed work the ability of previously proposed Psychoclonal algorithm to exploit the search space has been increased by making antibodies and antigen more cooperative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results obtained, are compared with other evolutionary algorithms such as Genetic Algorithm (GA) and Simulated Annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained, and convergence time required to reach the optimal /near optimal value of the solution